regexp.bitState.matchcap (field)

12 uses

	regexp (current package)
		backtrack.go#L40: 	matchcap []int
		backtrack.go#L106: 	if cap(b.matchcap) < ncap {
		backtrack.go#L107: 		b.matchcap = make([]int, ncap)
		backtrack.go#L109: 		b.matchcap = b.matchcap[:ncap]
		backtrack.go#L111: 	for i := range b.matchcap {
		backtrack.go#L112: 		b.matchcap[i] = -1
		backtrack.go#L282: 			if old := b.matchcap[1]; old == -1 || (longest && pos > 0 && pos > old) {
		backtrack.go#L283: 				copy(b.matchcap, b.cap)
		backtrack.go#L301: 	return longest && len(b.matchcap) > 1 && b.matchcap[1] >= 0
		backtrack.go#L362: 	dstCap = append(dstCap, b.matchcap...)